Enhanced Parallel Iterative Schedulers for IBWR Optical Packet Switches
نویسندگان
چکیده
In this paper we propose an enhanced parallel iterative scheduler for IBWR synchronous slotted OPS switches in SCWP mode. It obtains a maximal matching of packet demands without resource conflicts. The analytical and numerical results are highly competitive regarding previous work.
منابع مشابه
Parallel desynchronized block matching: A feasible scheduling algorithm for the input-buffered wavelength-routed switch
The Input-Buffered Wavelength-Routed (IBWR) switch is a promising switching architecture for slotted Optical Packet Switching (OPS) networks. The benefits of the IBWR fabric are a better scalability and lower hardware cost, when compared to output buffered OPS proposals. A previous work characterized the scheduling problem of this architecture as a type of matching problem in bipartite graphs. ...
متن کاملAnalysis of Parallel Hierarchical Matching Schedulers for Input-Queued Switches under Different Traffic Conditions
Input-queued packet switches are more scalable than output-queued ones. However, due to HOL blocking, their throughput is poor. The Virtual Output Queueing (VOQ) switch architecture and several buffer schedulers have been proposed to overcome this problem. Among them, the class of iterative maximal matching algorithms, with a first example being Parallel Iterative Matching (PIM), which uses ran...
متن کاملCombining Aggregation and Scheduling using an iterative Maximal Weight Matching Switch Scheduler
Hybrid electro-optical packet switches utilize optics in the backplane to switch optical packets from inputs to outputs on electronic line cards. The optical packets are traditionally considerably larger than minimum size IP packets. IP packets entering the switch must be formatted (segmented) and encapsulated in the optical packet format. This process is called packetisation or aggregation. Th...
متن کاملAccounting Information Systems Genetic Algorithms for All-Optical Shared Fiber-Delay-Line Packet Switches
All-optical shared fiber-delay-line (FDL) packet switches have been studied intensively in the literature and with the literature, many scheduling genetic algorithms have been proposed. However, these genetic algorithms suffer from not being able to provide a delay bound, or require complex timing methods to compute scheduling assignments. In this paper, we propose two fast scheduling algorithm...
متن کاملDecoupled parallel hierarchical matching schedulers
The load balanced Birkhoff–von Neumann switch is an elegant VOQ architecture with two outstanding characteristics: (i) it has a computational cost of Oð1Þ iterations and (ii) input controllers do not exchange information (as a result, it allows decoupled implementations with a low power density). The load balancing stage guarantees stability under a broad class of traffic patterns. It may alter...
متن کامل